Iterative algorithms for the curfew planning problem
نویسندگان
چکیده
The curfew planning problem is to design an annual timetable for railway track maintenance teams. Each team is capable of handling certain types of repairs and replacement jobs. The jobs are combined into a set of projects according to their locations and types. The timetable shows which project should be worked on by each team on a weekly basis throughout an entire year. Our objective is to design a schedule with minimum network disruption due to ongoing maintenance projects that require absolute curfew. Absolute curfew projects are those that cause complete closure of the rail traffic. For tackling this problem, we develop four optimization-based iterative algorithms. We also present very promising computational results obtained within a few minutes using data provided by a major North American railroad. Journal of the Operational Research Society (2011) 62, 593–607. doi:10.1057/jors.2010.1 Published online 10 March 2010
منابع مشابه
Iterative algorithms for families of variational inequalities fixed points and equilibrium problems
متن کامل
Strong convergence theorem for solving split equality fixed point problem which does not involve the prior knowledge of operator norms
Our contribution in this paper is to propose an iterative algorithm which does not require prior knowledge of operator norm and prove a strong convergence theorem for approximating a solution of split equality fixed point problem for quasi-nonexpansive mappings in a real Hilbert space. So many have used algorithms involving the operator norm for solving split equality fixed point problem, ...
متن کاملMeta-heuristic Algorithms for an Integrated Production-Distribution Planning Problem in a Multi-Objective Supply Chain
In today's globalization, an effective integration of production and distribution plans into a unified framework is crucial for attaining competitive advantage. This paper addresses an integrated multi-product and multi-time period production/distribution planning problem for a two-echelon supply chain subject to the real-world variables and constraints. It is assumed that all transportations a...
متن کاملNetwork Planning Using Iterative Improvement Methods and Heuristic Techniques
The problem of minimum-cost expansion of power transmission network is formulated as a genetic algorithm with the cost of new lines and security constraints and Kirchhoff’s Law at each bus bar included. A genetic algorithm (GA) is a search or optimization algorithm based on the mechanics of natural selection and genetics. An applied example is presented. The results from a set of tests carried ...
متن کاملHybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage
In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, deci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JORS
دوره 62 شماره
صفحات -
تاریخ انتشار 2011